package org.foreningsgatan.modular.lightsources;

/**
 * 
 * Copyright (c) 2008 Joakim Back
 * 
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 * 
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 * 
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 * SOFTWARE.
 * 
 * @author Joakim Back
 *
 */
public class CommonMath {
	public static boolean within(double v, double min, double max) {
		return (v >= min) && (v <= max);
	}

	public static boolean overlap(double a1, double a2, double b1, double b2) {
		return (a1 <= b2) && (a2 >= b1);
	}

	public static double distance(double x1, double y1, double x2, double y2) {
		double dx = x2 - x1;

		double dy = y2 - y1;

		return Math.sqrt(dx * dx + dy * dy);
	}
	
	public static int limit(int v, int min, int max) {
		if (v < min) v = min;
		if (v > max) v = max;
		
		return v;
	}
}
